Conditioning of linear-quadratic two-stage stochastic optimization problems
نویسندگان
چکیده
In this paper a condition number for linear-quadratic two-stage stochastic optimization problems is introduced as the Lipschitz modulus of the multifunction assigning to a (discrete) probability distribution the solution set of the problem. Being the outer norm of the Mordukhovich coderivative of this multifunction, the condition number canbe estimated fromabove explicitly in termsof the problemdata by applying appropriate calculus rules. Here, a chain rule for the extended partial second-order subdifferential recently proved byMordukhovich and Rockafellar plays a crucial role. Theobtained results are illustrated for the example of two-stage stochastic optimization problems with simple recourse.
منابع مشابه
Solving two-stage stochastic quadratic production planning problems
In this paper we formulate a two-stage stochastic quadratic optimization problem, that models a production planning problem of multiple products, over several time periods, with uncertain demands. This model considers quadratic inventory holding and demand backlogging recourse costs, which model the saturation phenomenon inherent to the increase of the inventory and/or backlogged demand levels....
متن کاملAn Algorithm for Two-Stage Stochastic Quadratic Problems
An algorithm for solving quadratic, two-stage stochastic problems is developed. The algorithm is based on the framework of the Branch and Fix Coordination (BFC) method. These problems have continuous and binary variables in the first stage and only continuous variables in the second one. The objective function is quadratic and the constraints are linear. The nonanticipativity constraints are fu...
متن کاملAbout One Sweep Algorithm for Solving Linear-Quadratic Optimization Problem with Unseparated Two-Point Boundary Conditions
In the paper a linear-quadratic optimization problem (LCTOR) with unseparated two-point boundary conditions is considered. To solve this problem is proposed a new sweep algorithm which increases doubles the dimension of the original system. In contrast to the well-known methods, here it refuses to solve linear matrix and nonlinear Riccati equations, since the solution of such multi-point optimi...
متن کاملDUALITY AND DECOMPOSITION FOR EXTENDED LINEAR-QUADRATIC STOCHASTIC CONTROL PROBLEMS IN DISCRETE TIME y
New dual problems emphasizing decomposability are established for a general class of stochastic dynamic optimization problems, with piecewise linearquadratic objective function. Optimality conditions are derived which emphasize decomposition. The dual dynamics are conditioned on the available system state information, and this leads to a symmetry that is well-suited to computational methods suc...
متن کاملA New Mathematical Approach based on Conic Quadratic Programming for the Stochastic Time-Cost Tradeoff Problem in Project Management
In this paper, we consider a stochastic Time-Cost Tradeoff Problem (TCTP) in PERT networks for project management, in which all activities are subjected to a linear cost function and assumed to be exponentially distributed. The aim of this problem is to maximize the project completion probability with a pre-known deadline to a predefined probability such that the required additional cost is min...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Program.
دوره 148 شماره
صفحات -
تاریخ انتشار 2014